SpeeDB: fast structural protein searches
نویسندگان
چکیده
منابع مشابه
SpeeDB: fast structural protein searches
MOTIVATION Interactions between amino acids are important determinants of the structure, stability and function of proteins. Several tools have been developed for the identification and analysis of such interactions in proteins based on the extensive studies carried out on high-resolution structures from Protein Data Bank (PDB). Although these tools allow users to identify and analyze interacti...
متن کاملSearches for Fast Radio Transients
We discuss optimal detection of fast radio transients from astrophysical objects while taking into account the effects of propagation through intervening ionized media, including dispersion, scattering and scintillation. Our analysis applies to the giant-pulse phenomenon exhibited by some pulsars, for which we show examples, and to radio pulses from other astrophysical sources, such as prompt r...
متن کاملA Fast Algorithm for Protein Structural Comparison
The goal of protein structural comparison attempts to establish an equivalence relation between polymer structures based on their shapes and threedimensional conformations. Root mean square deviation (RMSD), a frequently-used approach, measures the average distance between the selected atoms of superimposed proteins. Although the RMSD is most popularly implemented, it suffers from a few drawbac...
متن کاملPhyreStorm: A Web Server for Fast Structural Searches Against the PDB.
The identification of structurally similar proteins can provide a range of biological insights, and accordingly, the alignment of a query protein to a database of experimentally determined protein structures is a technique commonly used in the fields of structural and evolutionary biology. The PhyreStorm Web server has been designed to provide comprehensive, up-to-date and rapid structural comp...
متن کاملFast And Space Efficient Trie Searches
Searching and traversing m-way trees using tries is a well known and broadly used technique. Three algorithms are presented, two have constant insert, search or delete cost, are faster than Hash Trees and can be searched twice as quickly as Ternary Search Trees (TST). The third has a lgN byte compare cost, like a TST, but is faster. All require 60% less memory space per node than TST and, unlik...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2015
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btv274